Hexagonal Grid Drawings: Algorithms and Lower Bounds
نویسندگان
چکیده
We study drawings of graphs of maximum degree six on the hexagonal (triangular) grid, with the main focus of keeping the number of bends small. We give algorithms that achieve 3.5n + 3.5 bends for all simple graphs. We also prove optimal lower bounds on the number of bends for K7, and give asymptotic lower bounds for graph classes of varying connectivity.
منابع مشابه
Tree Drawings on the Hexagonal Grid
We consider straight-line drawings of trees on a hexagonal grid. The hexagonal grid is an extension of the common grid with inner nodes of degree six. We restrict the number of directions used for the edges from each node to its children from one to five, and to five patterns: straight, Y , ψ, X, and full. The ψ–drawings generalize hvor strictly upward drawings to ternary trees. We show that co...
متن کاملNew Lower Bounds For Orthogonal Drawings
An orthogonal drawing of a graph is an embedding of the graph in the two-dimensional grid such that edges are routed along grid-lines. In this paper we explore lower bounds for orthogonal graph drawings. We prove lower bounds on the number of bends and, when crossings are not allowed, also lower bounds on the size of the grid. Communicated by D. Wagner: submitted July 1997; revised November 199...
متن کاملArea-Efficient Static and Incremental Graph Drawings
In this paper, we present algorithms to produce orthogonal drawings of arbitrary graphs. As opposed to most known algorithms, we do not restrict ourselves to graphs with maximum degree 4. The best previous result gave an (m ? 1) (m 2 + 1)-grid for graphs with n nodes and m edges. We present algorithms for two scenarios. In the static scenario, the graph is given completely in advance. We produc...
متن کاملUpward Tree Drawings with Optimal
Rooted trees are usually drawn planar and upward, i.e., without crossings and without any parent placed below its child. In this paper we investigate the area requirement of planar upward drawings of rooted trees. We give tight upper and lower bounds on the area of various types of drawings, and provide linear-time algorithms for constructing optimal area drawings. Let T be a bounded-degree roo...
متن کاملComputing straight-line 3D grid drawings of graphs in linear volume
This paper investigates the basic problem of computing crossing-free straight-line 3D grid drawings of graphs such that the overall volume is small. Motivated by their relevance in the literature, we focus on families of graphs having constant queue number and on k-trees. We present algorithms that compute drawings of these families of graphs on 3D grids consisting of a constant number of paral...
متن کامل